The complete multigraphs and their decompositions into open trails
نویسندگان
چکیده
Balister [Combin. Probab. Comput. 12 (2003), 1–15] gave a necessary and sufficient condition for a complete multigraph Kn to be arbitrarily decomposable into closed trails of prescribed lengths. In this article we solve the corresponding problem showing that the multigraphs Kn are arbitrarily decomposable into open trails.
منابع مشابه
Edge-disjoint Open Trails in Complete Bipartite Multigraphs
Let Ka,b be a complete bipartite multigraph. We show a necessary and sufficient condition for a multigraph Ka,b to be arbitrarily decomposable into open trails. A motivation for us to investigated this problem is a paper of Balister [1].
متن کاملArbitrary decompositions into open and closed trails
The problem of arbitrary decomposition of a graph G into closed trails i.e. a decomposition into closed trails of prescribed lengths summing up to the size of the graph G was first considered in the case of the complete graph G = Kn (for odd n) in connection with vertexdistinguishing coloring of the union of cycles. Next, the same problem was investigated for other families of graphs. In this p...
متن کامل2-perfect Closed M-trail Systems of the Complete Directed Graph with Loops
Certain decompositions of complete directed graphs with loops into collections of closed trails which partition the edge set of the graph give rise to, and arise from, quasigroups. Such decompositions are said to be 2-perfect. The existence of these 2-perfect decompositions in which the closed trails are all of the same length m is examined. In particular, the set of values of n for which the o...
متن کاملDecompositions Of λKv Into Multigraphs With Four Vertices And Five Edges
This paper is motivated by a survey on the existence of G-designs by Adams, Bryant and Buchanan, where they gave the spectrum of the decomposition of complete graphs into graphs with small numbers of vertices. We give difference family-type constructions to decompose λ copies, where λ ≥ 2, of the complete graph K v into several multigraphs on four vertices and five edges including so called " 2...
متن کاملDecompositions of multigraphs into parts with two edges
Given a family F of multigraphs without isolated vertices, a multigraph M is called F-decomposable if M is an edge disjoint union of multigraphs each of which is isomorphic to a member of F . We present necessary and sufficient conditions for the existence of such decompositions if F comprises two multigraphs from the set consisting of a 2-cycle, a 2-matching and a path with two edges.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 42 شماره
صفحات -
تاریخ انتشار 2008